Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests
نویسندگان
چکیده
منابع مشابه
Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests
It is widely known that pattern sensitive faults are the most difficult faults to detect during the RAM testing process. One of the techniques which can be used for effective detection of this kind of faults is the multi-background test technique. According to this technique, multiple-run memory test execution is done. In this case, to achieve a high fault coverage, the structure of the consecu...
متن کاملPairs of codes with prescribed Hamming distances and coincidences
The main problem of coding theory is to construct codes with large Hamming-distances between the code-words. In this work we describe a fast algorithm for generating pairs of q-ary codes with prescribed pairwise Hamming-distances and coincidences (for a letter s 2 f0; 1; : : : ; q 1g, the number of s-coincidences between codewords a and b is the number of letters s in the same positions both in...
متن کاملAnchor-Points Algorithms for Hamming and Edit Distances Using MapReduce
Algorithms for computing similarity joins in MapReduce were offered in [2]. Similarity joins ask to find input pairs that are within a certain distance d according to some distance measure. Here we explore the “anchor-points algorithm” of [2]. We continue looking at Hamming distance, and show that the method of that paper can be improved; in particular, if we want to find strings within Hamming...
متن کاملCode pairs with specified parity of the Hamming distances
For code pairs (A, B); A, B C {0, 1 ..... 7-1}"; with mutually constant parity of the Hamming distances a conjecture of the first author concerning the maximal value of IAIIBI is established.
متن کاملMultiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability
We study multiple referenda and committee elections, when the ballot of each voter is simply a set of approved binary issues (or candidates). Two well-known rules under this model are the commonly used candidate-wise majority, also called the minisum rule, as well as the minimax rule. In the former, the elected committee consists of the candidates approved by a majority of voters, whereas the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2008
ISSN: 1641-876X
DOI: 10.2478/v10006-008-0030-y